A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time
نویسندگان
چکیده
منابع مشابه
A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time
This paper proposes an efficient exact algorithm for the general single-machine scheduling problem where machine idle time is permitted. The algorithm is an extension of the authors’ previous algorithm for the problem without machine idle time, which is based on the SSDP (Successive Sublimation Dynamic Programming) method. We first extend our previous algorithm to the problem with machine idle ...
متن کاملA Mathematical Programming Model and Genetic Algorithm for a Multi-Product Single Machine Scheduling Problem with Rework Processes
In this paper, a multi-product single machine scheduling problem with the possibility of producing defected jobs, is considered. We concern rework in the scheduling environment and propose a mixed-integer programming (MIP) model for the problem. Based on the philosophy of just-in-time production, minimization of the sum of earliness and tardiness costs is taken into account as the objective fu...
متن کاملA dynamic programming algorithm for the single machine total completion time scheduling problem with availability constraints
In this paper, we study the single machine total completion scheduling problem subject to a period of maintenance. The problem is known to be NP-hard. We propose a pseudo-polynomial dynamic programming algorithm for the problem with time complexity O(nR), where n refers to the number of jobs and R to the date of the beginning of the maintenance. The efficiency of the algorithm is improved using...
متن کاملa mathematical programming model and genetic algorithm for a multi-product single machine scheduling problem with rework processes
in this paper, a multi-product single machine scheduling problem with the possibility of producing defected jobs, is considered. we concern rework in the scheduling environment and propose a mixed-integer programming (mip) model for the problem. based on the philosophy of just-in-time production, minimization of the sum of earliness and tardiness costs is taken into account as the objective fu...
متن کاملOptimum Aggregate Inventory for Scheduling Multi-product Single Machine System with Zero Setup Time
In this paper we adopt the common cycle approach to economic lot scheduling problem and minimize the maximum aggregate inventory. We allow the occurrence of the idle times between any two consecutive products and consider limited capital for investment in inventory. We assume the setup times are negligible. To achieve the optimal investment in inventory we first find the idle times which minimi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Scheduling
سال: 2011
ISSN: 1094-6136,1099-1425
DOI: 10.1007/s10951-011-0242-0